On smallest 3-polytopes of given graph radius
نویسندگان
چکیده
The 3-polytopes are planar, 3-connected graphs. A classical question is, given r≥3, is the 2(r−1)-gonal prism K2×C2(r−1) unique 3-polytope of graph radius r and smallest size? Under some extra assumptions, we answer this in positive.
منابع مشابه
On the smallest 3-cop win graph
In the game of cops and robbers on a graph G = (V,E), k cops try to catch a robber. On the cop turn, each cop may move to a neighboring vertex or remain in place. On the robber’s turn, he moves similarly. The cops win if there is some time at which a cop is at the same vertex as the robber. Otherwise, the robber wins. The minimum number of cops required to catch the robber is called the cop num...
متن کاملOn the mean radius of permutation polytopes
Let X S n be a subset of the symmetric group S n and let Q X IR n 2 be the convex hull of the set of permutation matrices representing the elements of X in IR n 2. We present some formulas relating the cardinality of X and the maximal value of a typical linear function on Q X. Applications to the average case analysis of Combinatorial Optimization problems and to eecient counting are discussed.
متن کاملThe Petersen graph is the smallest 3-cop-win graph
In the game of cops and robbers on a graph G = (V,E), k cops try to catch a robber. On the cop turn, each cop may move to a neighboring vertex or remain in place. On the robber’s turn, he moves similarly. The cops win if there is some time at which a cop is at the same vertex as the robber. Otherwise, the robber wins. The minimum number of cops required to catch the robber is called the cop num...
متن کاملThe smallest Laplacian spectral radius of graphs with a given clique number
Article history: Received 23 September 2011 Accepted 30 March 2012 Available online 4 May 2012 Submitted by R.A. Brualdi AMS classification: 05C50
متن کاملThe Smallest Spectral Radius of Graphs with a Given Clique Number
The first four smallest values of the spectral radius among all connected graphs with maximum clique size ω ≥ 2 are obtained.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2023
ISSN: ['1872-681X', '0012-365X']
DOI: https://doi.org/10.1016/j.disc.2023.113322